package com;

import java.util.concurrent.ForkJoinPool;

/*
 * 数组的冒泡排序的实现
 * 
 */
public class BubbleSortTest {
	public static void main(String[] args) {
		
		int[] arr = new int[]{43,32,76,-98,0,64,33,-21,32,99};

		//外层需要比的大轮
		for (int i = 0; i < arr.length - 1; i++) {
			//两个两个比需要的轮数
			for(int j = 0; j < arr.length - i - 1; j++){
				if(arr[j] > arr[j + 1]){
					int temp = arr[j + 1];
					arr[j + 1] = arr[j];
					arr[j] = temp;
				}
			}
		}

		for(int i = 0;i < arr.length;i++){
			System.out.print(arr[i] + "\t");
		}

	}
}
